//
// Created by Jisam on 29/09/2024 7:01 PM.
// Solution of  b
//#pragma GCC optimize(3)
#include <bits/stdc++.h>

using namespace std;
#define coutn(x) cout << (x) << "\n"
#define endl "\n"
#define PSI pair<string,int>
#define PII pair<int,int>
#define PDI pair<double,int>
#define PDD pair<double,double>
#define VVI vector<vector<int>>
#define VI vector<int>
#define VS vector<string>
#define PQLI priority_queue<int, vector<int>, less<int>>
#define PQGI priority_queue<int, vector<int>, greater<int>>
#define code_by_jisam cin.tie(nullptr)->sync_with_stdio(false);
typedef long long i64;
typedef unsigned u32;
typedef unsigned long long u64;
typedef __int128 i128;
int dx[] = {-1, 1, 0, 0, 1, 1, -1, -1,};
int dy[] = {0, 0, -1, 1, 1, -1, -1, 1,};

void solution() {
    i64 n,x;
    cin >> n >> x;
    i64 ans = 0;
    while(n --){
        int t;
        cin >> t;
        if (x ==0){
            continue;
        }
        if (x > 0){
            x -= t;
            ans += t;
        }else{
            x += t;
            ans += t;
        }
    }
    coutn(ans);
}

int main() {
    code_by_jisam;
    i64 T = 1;
//    cin >> T;
    while (T--) {
        solution();
    }
    return 0;
}